منابع مشابه
Improper Graceful and Odd-graceful Labellings of Graph Theory
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
متن کاملThe Odd-Distance Plane Graph
The vertices of the odd-distance graph are the points of the plane R. Two points are connected by an edge if their Euclidean distance is an odd integer. We prove that the chromatic number of this graph is at least five. We also prove that the odd-distance graph in R is countably choosable, while such a graph in R is not.
متن کاملTowards more robust internetworks : an application of graph theory
As networks become increasingly connected to and dependent upon one another, the size and complexity of the resulting internetworks are increasing. This poses a threat to the security and functionality of these networks. In this article we explain how graph theory can be used to model internetworks and improve their resilience against failures and attacks. We evaluate the robustness of various ...
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کاملGraph homomorphism into an odd cycle
For graphs G and H, a map f : V (G) 7→ V (H) is a homomorphism if f preserves adjacency. Let Hom(G,H) denote the set of all homomorphisms from G into H. In this paper, we proved that for a simple graph G with n = |V (G)| and for k with n ≥ k ≥ 5, if the odd girth of G is at least 2k+1 and if the minimum degree δ(G) > 2n/(2k+3), then Hom(G,Z2k+1) 6= ∅, where Z2k+1 denotes the cycle of length 2k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90055-2